Euclidean and non-Euclidean norms in a plane
نویسندگان
چکیده
منابع مشابه
Non-Euclidean norms and data normalisation
In this paper, we empirically examine the use of a range of Minkowski norms for the clustering of real world data. We also investigate whether normalisation of the data prior to clustering affects the quality of the result. In a nearest neighbour search on raw real world data sets, fractional norms outperform the Euclidean and higher-order norms. However, when the data are normalised, the resul...
متن کاملOld and New Results in the Foundations of Elementary Plane Euclidean and Non-Euclidean Geometries
By “elementary” plane geometry I mean the geometry of lines and circles—straightedge and compass constructions—in both Euclidean and non-Euclidean planes. An axiomatic description of it is in Sections 1.1, 1.2, and 1.6. This survey highlights some foundational history and some interesting recent discoveries that deserve to be better known, such as the hierarchies of axiom systems, Aristotle’s a...
متن کاملSpatial Analysis in curved spaces with Non-Euclidean Geometry
The ultimate goal of spatial information, both as part of technology and as science, is to answer questions and issues related to space, place, and location. Therefore, geometry is widely used for description, storage, and analysis. Undoubtedly, one of the most essential features of spatial information is geometric features, and one of the most obvious types of analysis is the geometric type an...
متن کاملThe non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملGeneral Proximal Gradient Method: A Case for Non-Euclidean Norms
In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity operator for a broad class of structure priors by proposing a polynomial-time approach to approximately compute it. We also identify a special c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1971
ISSN: 0019-2082
DOI: 10.1215/ijm/1256052715